Solving railway line planning problems using a decomposition algorithm
Authors
Abstract:
The passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. A line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. A new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems. Since the solution provided by decomposition algorithm is not of the integer number type, a heuristic algorithm has been proposed for converting the results to integer numbers. The objective function for the line planning problem in this article is to maximize the number of direct passengers. Results on the proposed solution method, for the test problems, are compared to those of solutions generated via CPLEX software. Results show that the proposed solution method has high performance and accuracy. As a case study, optimized passenger railway lines in Iranian railway have been determined using the proposed algorithm.
similar resources
solving railway line planning problems using a decomposition algorithm
the passenger line planning is a process of strategic long-term decision-making problem in the field of railway passenger planning. a line is a route between starting point and destination with certain stops, which has a certain frequency of train schedule. a new solution based on decomposition algorithm has been proposed in this paper, which is defined in a master problem and two sub problems....
full textOn solving multi-type railway line planning problems
An important strategic element in the planning process of a railway operator is the development of a line plan, i.e., a set of routes (paths) on the network of tracks, operated at a given hourly frequency. The models described in the literature have thus far considered only lines that halt at all stations along their route. In this paper we introduce several models for solving line planning pro...
full textA Branch-and-Cut Approach for Solving Railway Line-Planning Problems
A important strategic phase in the planning process of a railway operator is the development of a line plan, i.e., a set of routes (paths) in a network of tracks, operated at a given hourly frequency. We consider a model formulation of the line-planning problem where total operating costs are to be minimized. This model is solved with a branch-and-cut approach, for which we develop a variety of...
full textOn solving multi-type line planning problems
An important strategic element in the planning process of a railway operator is the development of a line plan, i.e. a set of routes (paths) on the network of tracks, operated at a given hourly frequency. The models described in the literature have thus far considered only lines that halt at all stations along their route. In this paper we introduce several models for solving line planning prob...
full textSolving Railway Track Allocation Problems
The optimal track allocation problem (OPTRA), also known as the train routing problem or the train timetabling problem, is to find, in a given railway network, a conflict-free set of train routes of maximum value. We propose a novel integer programming formulation for this problem that is based on additional ‘configuration’ variables. Its LP-relaxation can be solved in polynomial time. These re...
full textSolving Large-Scale Planning Problems by Decomposition and Macro Generation
Large-scale classical planning problems such as factory assembly problems pose a significant challenge for domainindependent planners. We propose a macro-based planner which automatically identifies subproblems, generate macros from subplans and integrate the subplans by solving the whole augmented problem. We show experimentally that our approach can be used to solve large problem instances th...
full textMy Resources
Journal title
volume 1 issue 1
pages 25- 36
publication date 2013-10-01
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023